Constrained non-crossing Brownian motions, fermions and the Ferrari–Spohn distribution

Enumerating Constrained Non-crossing Minimally Rigid Frameworks

In this paper we present an algorithm for enumerating without repetitions all the non-crossing generically minimally rigid bar-and-joint frameworks under edge constraints, which we call constrained non-crossing Laman frameworks, on a given set of n points in the plane. Our algorithm is based on the reverse search paradigm of Avis and Fukuda. It generates each output graph in O(n) time and O(n) ...

Enumerating Constrained Non-crossing Geometric Spanning Trees

In this paper we present an algorithm for enumerating without repetitions all non-crossing geometric spanning trees on a given set of n points in the plane under edge constraints (i.e., some edges are required to be included in spanning trees). We will first prove that a set of all edge-constrained non-crossing spanning trees is connected via remove-add flips, based on the constrained smallest ...

Bouncing skew Brownian motions

We consider two skew Brownian motions, driven by the same Brownian motion, with different starting points and different skewness coefficients. In [13], the evolution of the distance between the two processes, in local time scale and up to their first hitting time is shown to satisfy a stochastic differential equation with jumps. The jumps of this S.D.E. are naturally driven by the excursion pro...

Nonintersecting Planar Brownian Motions

In this paper we construct a measure on pairs of Brownian motions starting at the same point conditioned so their paths do not intersect. The construction of this measure is a start towards the rigorous understanding of nonintersecting Brownian motions as a conformal eld. Let B 1 ; B 2 be independent Brownian motions in R 2 starting at distinct points on the unit circle. Let T j r be the rst ti...

Perturbed Brownian Motions